翻訳と辞書 |
Barwise compactness theorem : ウィキペディア英語版 | Barwise compactness theorem In mathematical logic, the Barwise compactness theorem, named after Jon Barwise, is a generalization of the usual compactness theorem for first-order logic to a certain class of infinitary languages. It was stated and proved by Barwise in 1967. ==Statement of the theorem==
Let be a countable admissible set. Let be an -finite relational language. Suppose is a set of -sentences, where is a set with parameters from , and every -finite subset of is satisfiable. Then is satisfiable.
抄文引用元・出典: フリー百科事典『 ウィキペディア(Wikipedia)』 ■ウィキペディアで「Barwise compactness theorem」の詳細全文を読む
スポンサード リンク
翻訳と辞書 : 翻訳のためのインターネットリソース |
Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.
|
|